Learning Non-Deterministic Multi-Agent Planning Domains
نویسندگان
چکیده
In this paper, we present an algorithm for learning nondeterministic multi-agent planning domains from execution examples. The algorithm uses a master-slave decomposition of two population-based stochastic local search algorithms and integrates binary decision diagrams to reduce the size of the search space. Our experimental results show that the learner has high convergence rates due to an aggressive exploitation of example-driven search and an efficient separation of concurrent activities. Moreover, even though the learning problem is at least as hard as learning disjoint DNF formulas, large domains can be learned accurately within a few minutes.
منابع مشابه
OBDD-based Universal Planning: Specifying and Solving Planning Problems for Synchronized Agents in Non-deterministic Domains
Recently model checking representation and search techniques were shown to be eeciently applicable to planning, in particular to non-deterministic planning. Such planning approaches use Ordered Binary Decision Diagrams (obdds) to encode a planning domain as a non-deterministic nite automaton (NFA) and then apply fast algorithms from model checking to search for a solution. obdds can eeectively ...
متن کاملOBDD-based Universal Planning for Synchronized Agents in Non-Deterministic Domains
Recently model checking representation and search techniques were shown to be ef-ciently applicable to planning, in particular to non-deterministic planning. Such planning approaches use Ordered Binary Decision Diagrams (obdds) to encode a planning domain as a non-deterministic nite automaton and then apply fast algorithms from model checking to search for a solution. obdds can eeectively scale...
متن کاملPlanning for a Single Agent in a Multi-Agent Environment Using FOND
Single-agent planning in a multi-agent environment is challenging because the actions of other agents can a↵ect our ability to achieve a goal. From a given agent’s perspective, actions of others can be viewed as non-deterministic outcomes of that agent’s actions. While simple conceptually, this interpretation of planning in a multi-agent environment as non-deterministic planning remains challen...
متن کاملOBDD-Based Universal Planning for Multiple Synchronized Agents in Non-Deterministic Domains
Model checking representation and search lechniclueS were recently shown to be efficiently applicahle to planning, in particular to non-deterministic plam,ing. Ordered Binaxy Dt:cision Diagram.~ (OBDD.~) encode planning domain as a non-det ermi nist i c finite’ aul.omaton (NI:A) and fast algorhhms fi’om moclel checking search for a solution plan. With proper encodings. OBDDs (’all effectively s...
متن کاملLeveraging FOND Planning Technology to Solve Multi-Agent Planning Problems
Single-agent planning in a multi-agent environment is challenging because the actions of other agents can affect our ability to achieve a goal. From a given agent’s perspective, actions of others can be viewed as non-deterministic outcomes of that agent’s actions. While simple conceptually, this interpretation of planning in a multi-agent environment as non-deterministic planning is challenging...
متن کامل